Hamilton cycles in Euler tour graphs Q& A on sex 欧拉环游图的边哈密顿性
Connectivity of Euler Tour Graphs Euler环游图的连通度
In this paper, we describe some general techniques in the design of parallel algorithms, balanced binary tree method, the doubling technique, the divide-and-conquer technique, compress-on technique and the Euler's tour technique. 本文讨论并行算法设计中的几种常用展术:平衡二叉树法、倍增法、分治技术、压缩技术和欧拉遍历技术。
Algorithms searching for a directed Euler tour in a Eulerian digraph and the shortest Euler trial in a non-Eulerian digraph are also developed. 除此,还给出了在非有向欧拉图中找一条最短欧拉道路的算法。